Expressing Independence in a Possibilistic Framework and its Application to Default Reasoning
نویسندگان
چکیده
Possibility theory offers a general framework for dealing with default rules of the form "generally, if p, then q" which are modelled by constraints expressing that having p and q true is strictly more possible than having p and not q true. Then possibilistic logic offers an inference machinery for default reasoning which obeys classical postulates for nonmonotonic reasoning including rational monotony. In this paper after presenting an overview of the possibilistic approach to default reasoning, we discuss how to express independence information of the type "in context p, the truth or the falsity of r has no influence on the truth of q". A brief discussion of the modelling of independence in possibility theory is provided. Taking into account independence assumptions leads to supplement the given set of defaults with more specific defaults; this allows to deal with independence information in a way homogeneous with defaults, and to solve blocking of property inheritance problems.
منابع مشابه
A Possibilistic Argumentation Decision Making Framework with Default Reasoning
In this paper, we introduce a possibilistic argumentation-based decision making framework which is able to capture uncertain information and exceptions/defaults. In particular, we define the concept of a possibilistic decision making framework which is based on a possibilistic default theory, a set of decisions and a set of prioritized goals. This set of goals captures user preferences related ...
متن کاملAn Experimental Analysis of Possibilistic Default Reasoning
This article provides an experimental analysis of the possibilistic handling of default rules. Three different nonmonotonic consequence relations are considered: minimum specificity inference (MSP), lexicographical closure (LC), and epsilon-belief functions (LCD). The latter was initially proposed within the belief function framework; it is rephrased here within a possibility theory framework. ...
متن کاملCOMBINING HYPOTHETICAL REASONING a n d PLAUSIBLE INFERENCE IN POSSIBILISTIC LOGIC*
Possibilistic logic provides an efficient tool for handling uncertain and nonmonotonic reasoning on the one hand, and for hypothetical reasoning on the other hand. In the first situation, logic formulas are simply weighted by lower bounds of a necessity measure. Thus, formulas in a knowledge base are rank-ordered according to their levels of certainty. In the case of hypothetical reasoning, the...
متن کاملA model for non-monotonic reasoning using Dempster's rule
Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a probabilistic sense. More recently an e-calculus formulation of default reasoning (J. Pearl) shows that the application of Dempster's rule to a non-monotonic situation...
متن کاملFormalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994